The average number of spanning hypertrees in sparse uniform hypergraphs
نویسندگان
چکیده
An r-uniform hypergraph H consists of a set vertices V and edges whose elements are r-subsets V. We define hypertree to be connected which contains no cycles. A spans if it is subhypergraph all H. Greenhill et al. (2017) gave an asymptotic formula for the average number spanning trees in graphs with given, sparse degree sequence. prove analogous result hypergraphs given sequence k=(k1,…,kn). Our holds when r5kmax3=o((kr?k?r)n), where k kmax maximum degree.
منابع مشابه
Constructions of sparse uniform hypergraphs with high chromatic number
Arandomconstruction gives newexamples of simple hypergraphswith high chromatic number that have few edges and/or lowmaximumdegree. In particular, for every integers k ≥ 2, r ≥ 2, and g ≥ 3, there exist r-uniform non-k-colorable hypergraphs of girth at least g with maximum degree at most r kr−1 ln k . This is only 4r2 ln k times greater than the lower bound by Erdős and Lovász (ColloquiaMath Soc...
متن کاملEquitable Orientations of Sparse Uniform Hypergraphs
Caro, West, and Yuster (2011) studied how r-uniform hypergraphs can be oriented in such a way that (generalizations of) indegree and outdegree are as close to each other as can be hoped. They conjectured an existence result of such orientations for sparse hypergraphs, of which we present a proof.
متن کاملDecomposing Hypergraphs into Simple Hypertrees
Let T be a simple k-uniform hypertree with t edges. It is shown that if H is any k-uniform hypergraph with n vertices and with minimum degree at least n k−1 2k−1(k−1)! (1+o(1)), and the number of edges of H is a multiple of t then H has a T -decomposition. This result is asymptotically best possible for all simple hypertrees with at least two edges. Mathematics Subject Classification (1991): 05...
متن کاملThe average number of spanning trees in sparse graphs with given degrees
We give an asymptotic expression for the expected number of spanning trees in a random graph with a given degree sequence d = (d1, . . . , dn), provided that the number of edges is at least n + 12d 4 max, where dmax is the maximum degree. A key part of our argument involves establishing a concentration result for a certain family of functions over random trees with given degrees, using Prüfer c...
متن کاملThe Turán number of sparse spanning graphs
For a graph H, the extremal number ex(n,H) is the maximum number of edges in a graph of order n not containing a subgraph isomorphic to H. Let δ(H) > 0 and ∆(H) denote the minimum degree and maximum degree of H, respectively. We prove that for all n sufficiently large, if H is any graph of order n with ∆(H) ≤ √ n/200, then ex(n,H) = ( n−1 2 ) +δ(H)−1. The condition on the maximum degree is tigh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2021
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2020.112192